The Complexity of Black-Box Mechanism Design with Priors
نویسندگان
چکیده
منابع مشابه
Black-Box Reductions in Mechanism Design
A central question in algorithmic mechanism design is to understand the additional difficulty introduced by truthfulness requirements in the design of approximation algorithms for social welfare maximization. In this paper, by studying the problem of single-parameter combinatorial auctions, we obtain the first black-box reduction that converts any approximation algorithm to a truthful mechanism...
متن کاملOn the Impossibility of Black-Box Transformations in Mechanism Design
We consider the problem of converting an arbitrary approximation algorithm for a singleparameter optimization problem into a computationally efficient truthful mechanism. We ask for reductions that are black-box, meaning that they require only oracle access to the given algorithm and in particular do not require explicit knowledge of the problem constraints. Such a reduction is known to be poss...
متن کاملOn the Impossibility of Black-Box Transformations in Mechanism Design
A fundamental question in algorithmic mechanism design is whether any approximation algorithm for a single-parameter social-welfare maximization problem can be turned into a dominant-strategy truthful mechanism for the same problem (while preserving the approximation ratio up to a constant factor). A particularly desirable type of transformations—called black-box transformations— achieve the ab...
متن کاملOn the Impossibility of Black-Box Truthfulness Without Priors
We consider the problem of converting an arbitrary approximation algorithm for a singleparameter social welfare problem into a computationally efficient incentive compatible mechanism. We ask for reductions that are black-box, meaning that they require only oracle access to the given algorithm and (in particular) do not require explicit knowledge of the problem constraints. We demonstrate that,...
متن کاملThe Complexity of Black-Box Ring Problems
We study the complexity of some computational problems on finite black-box rings whose elements are encoded as strings of a given length and the ring operations are performed by a black-box oracle. We give a polynomial-time quantum algorithm to compute a basis representation for a given black-box ring. Using this result we obtain polynomial-time quantum algorithms for several natural computatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Economics and Computation
سال: 2020
ISSN: 2167-8375,2167-8383
DOI: 10.1145/3417744